The Asymptotic Number of Binary Codes and Binary Matroids
نویسندگان
چکیده
منابع مشابه
The asymptotic number of binary codes and binary matroids
The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
متن کاملAsymptotic Bound on Binary Self-Orthogonal Codes
We present two constructions for binary selforthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R = 1/2, by our constructive lower bound, the relative minimum distance δ ≈ 0.0595 (for GV bound, δ ≈ 0.110). Moreover, we have proved that the binary selforthogonal codes asymptotically achieve the...
متن کاملNumerical results on the asymptotic rate of binary codes
We compute upper bounds on the maximal size of a binary linear code of length n 1000, dimension k, and distance d For each value of d, the bound is found by solving the Delsarte linear programming problem. Relying on the results of the calculations, we discuss the known bounds on the size of codes and some recent conjectures made about them. The most important conclusion is that Delsarte’s line...
متن کاملInvolutions Of Connected Binary Matroids
We prove that if an involution φ is an automorphism of a connected binary matroid M , then there is a hyperplane of M that is invariant under φ. We also consider extensions of this result for higher connectivity.
متن کاملRemovable Circuits in Binary Matroids
We show that if M is a connected binary matroid of cogirth at least ve which does not have both an F 7-minor and an F 7-minor, then M has a circuit C such that M ? C is connected and r(M ? C) = r(M).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2005
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480104445538